Bounded nondeterminism and the approximation induction principle in process algebra (extended abstract)

This paper presents a new semantics of ACPτ, the Algebra of Communicating Processes with abstraction. This leads to a term model of ACPτ which is isomorphic to the model of process graphs modulo rooted τδ-bisimulation of Baeten, Bergstra & Klop In this model, the Recursive Definition Principle (RDP), the Commutativity of Abstraction (CA) and Koomen's Fair Abstraction Rule (KFAR) are satisfied, but the Approximation Induction Principle (AIP) is not. The combination of these four principles is proven to be inconsistent, while any combination of three of them is not. In [2] a restricted version of AIP is proved valid in the graph model. This paper proposes a simpler and less restrictive version of AIP, not containing guarded recursive specifications as a parameter, which is still valid. This infinitary rule is formulated with the help of a family Bn of unary predicates, expressing bounded nondeterminism